New Mathematics of Complexity and Its Biomedical Applications

A new approach to fuzzy quantities ordering based on distance method and its applications for solving fuzzy linear programming

Many ranking methods have been proposed so far. However, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. For overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...

A new class of function spaces on domains of R^d and its relations to classical function spaces

A new algorithm for computing SAGBI bases up to an arbitrary degree

We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

A New Five-Parameter Distribution: Properties and Applications

In this paper, a new five-parameter lifetime and reliability distribution named “the exponentiated Uniform-Pareto distribution (EU-PD),” has been suggested that it has a bathtub-shaped and inverse bathtub-shape for modeling lifetime data. This distribution has applications in economics, actuarial modelling, reliability modeling, lifetime and biological sciences. Firstly, the mathematical and st...

A path following interior-point algorithm for semidefinite optimization problem based on new kernel function

In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...